Comparing two-phase locking and optimistic concurrency control protocols in multiprocessor real-time databases

Previous studies (Haritsa et al., 1990) have shown that optimistic concurrency control (OCC) generally performs better than lock-based protocols in disk-based real-time database systems (RTDBS). We compare the two concurrency control protocols in both disk-based and memory-resident multiprocessor RTDBS. Based on their performance characteristics, a new lock-based protocol, called two phase locking-lock write all (2PL-LW), is proposed. The results of our performance evaluation experiments show that different characteristics of the two environments indeed have great impact on the protocols' performance. We identify such system characteristics and show that our new lock-based protocols, 2PL-LW, is better than OCC in meeting transaction deadlines in both disk-based and memory-resident RTDBS.published_or_final_versio

On Building Distributed Soft Real-Time Systems

When building a distributed real-time system, one can either build the whole system from scratch, or from pre-existing standard components. Although the former allows better scheduling design, it may not be economical in terms of the cost and time of development. This paper studies the performance of distributed soft real-time systems that use standard components with various scheduling algorithms and suggests ways to improve them.published_or_final_versio

Neural Enquirer: Learning To Query Tables In Natural Language

We propose NEURAL ENQUIRER — a neural network architecture for answering natural language (NL) questions based on a knowledge base (KB) table. Unlike existing work on end-to-end training of semantic parsers [13, 12], NEURAL ENQUIRER is fully “neuralized”: it finds distributed representations of queries and KB tables, and executes queries through a series of neural network components called “executors”. Executors model query operations and compute intermediate execution results in the form of table annotations at different levels. NEURAL ENQUIRER can be trained with gradient descent, with which the representations of queries and the KB table are jointly optimized with the query execution logic. The training can be done in an end-to-end fashion, and it can also be carried out with stronger guidance, e.g., step-by-step supervision for complex queries. NEURAL ENQUIRER is one step towards building neural network systems that can understand natural language in real-world tasks. As a proofof-concept, we conduct experiments on a synthetic QA task, and demonstrate that the model can learn to execute reasonably complex NL queries on small-scale KB tables.postprin

Methionine aminopeptidase as a novel Target for antibiotic therapy against staphylococcus aureus: a proteomic approach

Key Messages 1. Methionine aminopeptidase (MetAP) is an essential enzyme in Staphylococcus aureus and a potential target for novel antibiotics. 2. Two-dimensional electrophoresis gel identified more than 100 differences in protein expression between wild type and MetAP-deficient strains of S aureus. 3. Using mass spectroscopic techniques, 63 differentially expressed proteins were identified, of which some were related to purine biosynthesis and methionine metabolism.published_or_final_versio

CLUDE: An Efficient Algorithm for LU Decomposition Over a Sequence of Evolving Graphs

Session: Matrix Factorization, Clustering and Probabilistic DataIn many applications, entities and their relationships are represented by graphs. Examples include the WWW (web pages and hyperlinks) and bibliographic networks (authors and co-authorship). A graph can be conveniently modeled by a matrix from which various quantitative measures are derived. Some example measures include PageRank and SALSA (which measure nodes’ importance), and Personalized PageRank and Random Walk with Restart (which measure proximities between nodes). To compute these measures, linear systems of the form Ax = b, where A is a matrix that captures a graph’s structure, need to be solved. To facilitate solving the linear system, the matrix A is often decomposed into two triangular matrices (L and U). In a dynamic world, the graph that models it changes with time and thus is the matrix A that represents the graph. We consider a sequence of evolving graphs and its associated sequence of evolving matrices. We study how LU-decomposition should be done over the sequence so that (1) the decomposition is efficient and (2) the resulting LU matrices best preserve the sparsity of the matrices A’s (i.e., the number of extra non-zero entries introduced in L and U are minimized.) We propose a cluster-based algorithm CLUDE for solving the problem. Through an experimental study, we show that CLUDE is about an order of magnitude faster than the traditional incremental update algorithm. The number of extra non-zero entries introduced by CLUDE is also about an order of magnitude fewer than that of the traditional algorithm. CLUDE is thus an efficient algorithm for LU decomposition that produces high-quality LU matrices over an evolving matrix sequence.published_or_final_versio

Recommending anchor points in structure-preserving hypertext document retrieval

Traditional WWW search engines index and recommend individual Web pages to assist users in locating relevant documents. Users are often overwhelmed by the large answer set recommended by the search engines. The logical starting point of the hyper-document is thus hidden among the large basket of matching pages. Users need to spend a lot of effort browsing through the pages to locate the starting point, a very time consuming process. This paper studies the anchor point indexing problem. The anchor points of a given user query is a small set of key pages from which the larger set of documents that are relevant to the query can be easily reached. The use of anchor points help solve the problems of huge answer set and low precision suffered by most search engines by considering the hyper-link structures of the relevant documents, and by providing a summary view of the result set.published_or_final_versio

Natural Changes in Brain Temperature Underlie Variations in Song Tempo during a Mating Behavior

The song of a male zebra finch is a stereotyped motor sequence whose tempo varies with social context – whether or not the song is directed at a female bird – as well as with the time of day. The neural mechanisms underlying these changes in tempo are unknown. Here we show that brain temperature recorded in freely behaving male finches exhibits a global increase in response to the presentation of a female bird. This increase strongly correlates with, and largely explains, the faster tempo of songs directed at a female compared to songs produced in social isolation. Furthermore, we find that the observed diurnal variations in song tempo are also explained by natural variations in brain temperature. Our findings suggest that brain temperature is an important variable that can influence the dynamics of activity in neural circuits, as well as the temporal features of behaviors that some of these circuits generate

A comparison of hepatitis B viral markers of patients in different clinical stages of chronic infection

Hepatitis B viral markers may be useful for predicting outcomes such as liver-related deaths or development of hepatocellular carcinoma. We determined the frequency of these markers in different clinical stages of chronic hepatitis B infection. We compared baseline hepatitis B viral markers in 317 patients who were enrolled in a prospective study and identified the frequency of these tests in immune-tolerant (IT) patients, in inactive carriers , and in patients with either hepatitis B e antigen ( HBeAg)- positive or HBeAg-negative chronic hepatitis or cirrhosis. IT patients were youngest (median age 27 years) and HBeAg- negative patients with cirrhosis were oldest (median age 58 years) (p = 0.03 to < 0.0001). The male to female ratio was similar both in IT patients and in inactive carriers, but there was a male preponderance both in patients with chronic hepatitis and in patients with cirrhosis (p < 0.0001). The A1896 precore mutants were most prevalent in inactive carriers (36.4%) and HBeAg- negative patients with chronic hepatitis (38.8%; p < 0.0001), and the T 1762/A1764 basal core promoter mutants were most often detected in HBeAg- negative patients with cirrhosis (65.1%; p = 0.02). Genotype A was detected only in 5.3% of IT patients, and genotype B was least often detected in both HBeAg-Positive patients with chronic hepatitis and cirrhosis (p = 0.03). The hepatitis B viral DNA levels were lowest in inactive carriers (2.69 log(10) IU/mL) and highest in IT patients (6. 80 log(10) IU/mL; p = 0.02 to < 0.0001). At follow-up, HBeAg-positive and HBeAg-negative patients with cirrhosis accounted for 57 of 64 (89.1%) liver-related deaths (p < 0. 0001). Differences in baseline hepatitis B viral markers were detected in patients in various clinical stages of hepatitis B virus infection. HBeAg-positive and HBeAg- negative patients with cirrhosis accounted for the majority of the liver-related fatalities

Double Field Theory for Double D-branes

We consider Hull's doubled formalism for open strings on D-branes in flat space and construct the corresponding effective double field theory. We show that the worldsheet boundary conditions of the doubled formalism describe in a unified way a T-dual pair of D-branes, which we call double D-branes. We evaluate the one-loop beta function for the boundary gauge coupling and then obtain the effective field theory for the double D-branes. The effective field theory is described by a DBI action of double fields. The T-duality covariant form of this DBI action is thus a kind of "master" action, which describes all the double D-brane configurations related by T-duality transformations. We discuss a number of aspects of this effective theory.Comment: Latex, 1+33 pages. v2 with minor corrections, a new reference added. v3 a typo correcte

Renormalization of QCD_2

The low energy infrared scaling of the multi-color 2-dimensional quantum chromodynamics is determined in the framework of its bosonized model by using the functional renormalization group method with gliding sharp cut-off k in momentum space in the local potential approximation. The model exhibits a single phase with a superuniversal effective potential.Comment: 15 pages, 3 figures, final versio